#include<bits/stdc++.h>

using namespace std ;

const int N=1e5+5;

int n,r[N] ;
bool vis[N] ;

int main()
{
    freopen("duel.in","r",stdin) ;
    freopen("duel.out","w",stdout) ;
    scanf("%d",&n) ;
    for(int i=1 ;i<=n ;++i) scanf("%d",&r[i]);
    sort(r+1,r+1+n) ;
    memset(vis,0,sizeof(vis)) ;
    for(int i=1,j=2 ;i<=n && j<=n ;)
    {
        if(r[i]<r[j]) 
        {
            vis[i]=true ;
            ++i;++j;
        } else 
        {
            ++j;
        }
    }

    int ans=0;
    for(int i=1 ;i<=n ;++i)
    {
        if(!vis[i]) ++ans;
    }

    printf("%d",ans);
}